n-argument functor

См. также в других словарях:

• Functor — For functors as a synonym of function objects in computer programming to pass function pointers along with its state, see function object. For the use of the functor morphism presented here in functional programming see also the fmap function of… …   Wikipedia

• Predicate functor logic — In mathematical logic, predicate functor logic (PFL) is one of several ways to express first order logic (formerly known as predicate logic) by purely algebraic means, i.e., without quantified variables. PFL employs a small number of algebraic… …   Wikipedia

• Hom functor — In mathematics, specifically in category theory, Hom sets, i.e. sets of morphisms between objects, give rise to important functors to the category of sets. These functors are called Hom functors and have numerous applications in category theory… …   Wikipedia

• Categorial grammar — is a term used for a family of formalisms in natural language syntax motivated by the principle of compositionality and organized according to the view that syntactic constituents should generally combine as functions or according to a function… …   Wikipedia

• Function object — A function object, also called a functor or functional, is a computer programming construct allowing an object to be invoked or called as if it were an ordinary function, usually with the same syntax.Function objects are unrelated to functors in… …   Wikipedia

• Monad (functional programming) — In functional programming, a monad is a programming structure that represents computations. Monads are a kind of abstract data type constructor that encapsulate program logic instead of data in the domain model. A defined monad allows the… …   Wikipedia

• Triangulated category — A triangulated category is a mathematical category satisfying some axioms that are based on the properties of the homotopy category of spectra, and the derived category of an abelian category. A t category is a triangulated category with a t… …   Wikipedia

• Adjoint functors — Adjunction redirects here. For the construction in field theory, see Adjunction (field theory). For the construction in topology, see Adjunction space. In mathematics, adjoint functors are pairs of functors which stand in a particular… …   Wikipedia

• Map (higher-order function) — In many programming languages, map is the name of a higher order function that applies a given function to each element of a list, returning a list of results. They are examples of both catamorphisms and anamorphisms. This is often called apply… …   Wikipedia

• Prolog — infobox programming language paradigm = Logic programming year = 1972 designer = Alain Colmerauer implementations = BProlog, ECLiPSe, Ciao Prolog, GNU Prolog, Quintus, SICStus, Strawberry, SWI Prolog, YAP Prolog, tuProlog dialects = ISO Prolog,… …   Wikipedia

• Combinatory categorial grammar — (CCG) is an efficiently parseable, yet linguistically expressive grammar formalism. It has a transparent interface between surface syntax and underlying semantic representation, including predicate argument structure, quantification and… …   Wikipedia